Lattices and Maximum Flow Algorithms in Planar Graphs
نویسنده
چکیده
We show that the left/right relation on the set of s-t-paths of a plane graph induces a so-called submodular lattice. If the embedding of the graph is s-t-planar, this lattice is even consecutive. This implies that Ford and Fulkerson’s uppermost path algorithm for maximum flow in such graphs is indeed a special case of a two-phase greedy algorithm on lattice polyhedra. We also show that the properties submodularity and consecutivity cannot be achieved simultaneously by any partial order on the paths if the graph is planar but not s-t-planar, thus providing a characterization of this class of graphs.
منابع مشابه
Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs
In this paper we study the maximum two-flow problem in vertexand edge-capacitated undirected STI-planar graphs, that is, planar graphs where the vertices of each terminal pair arc on the same face. For such graphs we provide an O(n) algorithm for finding a minimum two-cut and an O(n log n) algorithm for determining a maximum two-flow and show that the value of a maximum two-flow equals the valu...
متن کاملMaximum st-Flow in Directed Planar Graphs via Shortest Paths
Minimum cuts have been closely related to shortest paths in planar graphs via planar duality – so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason – so long as the source and the sink are on a common face. In this paper, we give a correspondence between maximum flows and shortest paths via duality in directed planar graphs with no c...
متن کاملMultiple-source multiple-sink maximum flow in planar graphs
In this paper we show an O(n log n) time algorithm for finding a maximum flow in a planar graph with multiple sources and multiple sinks. This is the fastest algorithm whose running time depends only on the number of vertices in the graph. For general (nonplanar) graphs the multiple-source multiple-sink version of the maximum flow problem is as difficult as the standard single-source single-sin...
متن کاملExtensions to Network Flow Interdiction on Planar Graphs
Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general networks, pseudo-polynomial algorithms were found for planar networks with a single source and a single sink and without the possibility to remove vertices. In ...
متن کامل